Edge colorings and total colorings of integer distance graphs
نویسندگان
چکیده
منابع مشابه
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملVertex-, edge-, and total-colorings of Sierpinski-like graphs
Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiński graphs S(n, k), graphs S (n, k), and graphs S(n, k) are considered. In particular, χ′′(Sn), χ (S(n, k)), χ(S(n, k)), χ(S(n, k)), χ(S(n, k)), and χ(S(n, k)) are determined.
متن کاملConflict-Free Colorings - Of Graphs and Hypergraphs - Diploma-Thesis of
Conflict-free colorings are known as vertex-colorings of hypergraphs. In such a coloring each hyperedge contains a vertex whose color is not assigned to any other vertex within this edge. In this thesis the notion of conflict-free colorings is translated to edge-colorings of graphs. For graphs G and H a conflict-free coloring of G ensures an edge of unique color in each copy of H in G. The mini...
متن کاملBounds on Edge Colorings with Restrictions on the Union of Color Classes
We consider constrained proper edge colorings of the following type: Given a positive integer j and a family F of connected graphs on 3 or more vertices, we require that the subgraph formed by the union of any j color classes has no copy of any member of F . This generalizes some well-known types of colorings such as acyclic edge colorings, distance-2 edge colorings, low treewidth edge coloring...
متن کاملStructure of Colored Complete Graphs Free of Proper Cycles
For a fixed integer m, we consider edge colorings of complete graphs which contain no properly edge colored cycle Cm as a subgraph. Within colorings free of these subgraphs, we establish a global structure by bounding the number of colors that can induce a spanning and connected subgraph. In the case of small cycles, namely C4, C5, and C6, we show that our bounds are sharp.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 22 شماره
صفحات -
تاریخ انتشار 2002